Approximate Dynamic Programming for Communication-Constrained Sensor Network Management
نویسندگان
چکیده
منابع مشابه
Approximate Dynamic Programming For Sensor Management
This paper studies the problem of dynamic scheduling of multi-mode sensor resources for the problem of classification of multiple unknown objects. Because of the uncertain nature of the object types, the problem is formulated as a partially observed Markov decision problem with a large state space. The paper describes a hierarchical algorithm approach for efficient solution of sensor scheduling...
متن کاملSparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the complexity implied by the required naturalness of dialogue systems and the inability of standard RL algorithms to scale up. Another issue is the sparsity of the data available for training in the dialogue domain which can ...
متن کاملAn Approximate Dynamic Programming Approach to Network Revenue Management
We develop an approximation algorithm for a dynamic capacity allocation problem with Markov modulated customer arrival rates. For each time period and each state of the modulating process, the algorithm approximates the dynamic programming value function using a concave function that is separable across resource inventory levels. We establish via computational experiments that our algorithm inc...
متن کاملSensor Scheduling for Target Tracking Using Approximate Dynamic Programming
To trade off tracking accuracy and interception risk in a multi-sensor multi-target tracking context, we study the sensor-scheduling problem where we aim to assign sensors to observe targets over time. Our problem is formulated as a partially observable Markov decision process, and this formulation is applied to develop a non-myopic sensor-scheduling scheme. We resort to extended Kalman filteri...
متن کاملApproximate Parametric Dynamic Programming in Inventory Management
We present an approximation method for inventory management under multiple suppliers and stochastic lead times. The method is based on parametric dynamic programming using convex piecewise linear approximations of the differential cost function in approximate relative value iteration steps and works for a range of stochastic control problems with linear dynamics and convex piecewise linear imme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2007
ISSN: 1053-587X
DOI: 10.1109/tsp.2007.896099